منابع مشابه
On strong commutativity-preserving maps
Let R be a ring with center Z(R). We write the commutator [x, y] = xy− yx, (x, y ∈ R). The following commutator identities hold: [xy,z] = x[y,z] + [x,z]y; [x, yz] = y[x,z] + [x, y]z for all x, y,z ∈ R. We recall that R is prime if aRb = (0) implies that a= 0 or b = 0; it is semiprime if aRa = (0) implies that a = 0. A prime ring is clearly a semiprime ring. A mapping f : R→ R is called centrali...
متن کاملStructure-preserving color transformations using Laplacian commutativity
Mappings between color spaces are ubiquitous in image processing problems such as gamut mapping, decolorization, and image optimization for color-blind people. Simple color transformations often result in information loss and ambiguities (for example, when mapping from RGB to grayscale), and one wishes to find an image-specific transformation that would preserve as much as possible the structur...
متن کاملMedial commutativity
It is shown that all the assumptions for symmetric monoidal categories flow out of a unifying principle involving natural isomorphisms of the type (A ∧B) ∧ (C ∧D) → (A ∧ C) ∧ (B ∧D), called medial commutativity. Medial commutativity in the presence of the unit object enables us to define associativity and commutativity natural isomorphisms. In particular, Mac Lane’s pentagonal and hexagonal coh...
متن کاملCommutativity of Reducers
In the Map-Reduce programming model for data parallel computation in a cloud environment, the reducer phase is responsible for computing an output key-value pair, given a sequence of input values associated with a particular key. Because of non-determinism in transmitting key-value pairs over the network, the inputs may not arrive at a reducer in a fixed order. This gives rise to the reducer co...
متن کاملLearning Commutativity Specifications
In this work we present a new sampling-based “black box” inference approach for learning the behaviors of a library component. As an application, we focus on the problem of automatically learning commutativity specifications of data structures. This is a very challenging problem, yet important, as commutativity specifications are fundamental to program analysis, concurrency control and even low...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 2001
ISSN: 0022-4049
DOI: 10.1016/s0022-4049(99)00154-1